Pathologies of some Minimum Distance Estimators
نویسندگان
چکیده
منابع مشابه
Selecting tuning parameters in minimum distance estimators
Many minimum distance estimators have the potential to provide parameter estimates which are both robust and efficient and yet, despite these highly desirable theoretical properties, they are rarely used in practice. This is because the performance of these estimators is rarely guaranteed per se but obtained by placing a suitable value on some tuning parameter. Hence there is a risk involved in...
متن کاملMinimum Distance Estimators for Nonparametric Models with Grouped Dependent Variables
This Version: January 2002 This paper develops minimum distance estimators for nonparametric models where the dependent variable is known only to fall in a specified group with observable thresholds, while its true value remains unobserved and possibly censored. Such data arise commonly in major U.S and U.K data sets where, e.g., the thresholds between which earnings fall are observed, but not ...
متن کاملParameter Estimation of Some Archimedean Copulas Based on Minimum Cramér-von-Mises Distance
The purpose of this paper is to introduce a new estimation method for estimating the Archimedean copula dependence parameter in the non-parametric setting. The estimation of the dependence parameter has been selected as the value that minimizes the Cramér-von-Mises distance which measures the distance between Empirical Bernstein Kendall distribution function and true Kendall distribution functi...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملThe Minimum Distance of Some Narrow-Sense Primitive BCH Codes
Due to wide applications of BCH codes, the determination of their minimum distance is of great interest. However, this is a very challenging problem for which few theoretical results have been reported in the last four decades. Even for the narrow-sense primitive BCH codes, which form the most well-studied subclass of BCH codes, there are very few theoretical results on the minimum distance. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1988
ISSN: 0090-5364
DOI: 10.1214/aos/1176350821